Exponentiation and second-order bounded arithmetic

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

From Bounded Arithmetic to Second Order Arithmetic via Automorphisms

In this paper we examine the relationship between automorphisms of models of I∆0 (bounded arithmetic) and strong systems of arithmetic, such as PA, ACA0 (arithmetical comprehension schema with restricted induction), and Z2 (second order arithmetic). For example, we establish the following characterization of PA by proving a “reversal” of a theorem of Gaifman: Theorem. The following are equivale...

متن کامل

CZF and Second Order Arithmetic

Constructive ZF + full Separation is shown to be equiconsistent with Second Order Arithmetic.

متن کامل

Third-Order Computation and Bounded Arithmetic

We describe a natural generalization of ordinary computation to a third-order setting and give a function calculus with nice properties and recursion-theoretic characterizations of several large complexity classes. We then present a number of third-order theories of bounded arithmetic whose definable functions are the classes of the EXP-time hierarchy in the third-order setting.

متن کامل

Subsystems of Second Order Arithmetic Second Edition

Foundations of mathematics is the study of the most basic concepts and logical structure of mathematics, with an eye to the unity of human knowledge. Almost all of the problems studied in this book are motivated by an overriding foundational question: What are the appropriate axioms for mathematics? Through a series of case studies, these axioms are examined to prove particular theorems in core...

متن کامل

A Improved Witnessing and Local Improvement Principles for Second-Order Bounded Arithmetic

This paper concerns the second order systems U2 and V 1 2 of bounded arithmetic, which have proof theoretic strengths corresponding to polynomial space and exponential time computation. We formulate improved witnessing theorems for these two theories by using S2 as a base theory for proving the correctness of the polynomial space or exponential time witnessing functions. We develop the theory o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Pure and Applied Logic

سال: 1990

ISSN: 0168-0072

DOI: 10.1016/0168-0072(90)90023-u